Discretized Learning Algorithm for Variable Hierarchical Structure Learning Automata with Stationary Random Environment at Each Level
نویسندگان
چکیده
منابع مشابه
A new learning algorithm for the hierarchical structure learning automata operating in the nonstationary S-model random environment
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability I to the optimal path under the certain type of nonstationary environment. Several computer simulation results confirm the effectiveness of the proposed algorithm.
متن کاملDiscretized estimator learning automata
BOUNDED MEMORY PROBABILISTIC MOVE-TO-FRONT OPERATIONS The concept of performing probabilistic move operations on an accessed element is not entirely new. Kan and Ross [9] suggested a probabilistic transposition scheme and showed that no advantage was obtained by rendering the scheme probabilistic. Their scheme, however, required that the probability of performing the operation, be time invarian...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملSequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR
Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...
متن کاملHigh Level Synthesis using Learning Automata Genetic Algorithm
High-level synthesis consists of many interdependent tasks such as scheduling, allocation and binding. All tasks in high-level synthesis are NP-complete and the design objectives are in conflict for nature, most of the already proposed approaches are not efficient in the exploration of the design space and not effective in the identification of different trade-offs. For these reasons, genetic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2000
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.36.676